Expansions for Joint Laplace Transform of Stationary Waiting Times in (max, +)-linear Systems with Poisson Input
نویسندگان
چکیده
We give a Taylor series expansion for the joint Laplace transform of stationary waiting times in open (max,+)-linear stochastic systems with Poisson input. Probabilistic expressions are derived for coefficients of all orders. Even though the computation of these coefficients can be hard for certain systems, it is sufficient to compute only a few coefficients to obtain good approximations (especially under the assumption of light traffic.) Combining this new result with the earlier expansion formula for the mean stationary waiting times, we also provide a Taylor series expansion for the covariance of stationary waiting times in such systems. It is well known that (max,+) linear systems can be used to represent stochastic Petri nets belonging to the class of event graphs. This class contains various instances of queueing networks like acyclic or cyclic fork-and-join queueing networks, finite or infinite capacity tandem queueing networks with various types of blocking, synchronized queueing networks and so on. It also contains some basic manufacturing models such as kanban networks, assembly systems and so forth. The applicability of this expansion technique is discussed for several systems of this type. Differentiability of Functionals of Poisson Processes.
منابع مشابه
Transient and Stationary Waiting Times in (max, +)-Linear Systems with Poisson Input
We consider a certain class of vectorial evolution equations, which are linear in the (max,+) semi-eld. They can be used to model several types of discrete event systems, in particular stochastic service systems where we assume that the arrival process of customers (tokens, jobs, etc.) is Poisson. Under natural Cramer type conditions on certain variables, we show that the expected waiting time ...
متن کاملA single server perishable inventory system with N additional options for service
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...
متن کاملWaiting times in polling systems with various service disciplines
We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...
متن کاملOn the Fractional Poisson Process and the Discretized Stable Subordinator
We consider the renewal counting number process N = N(t) as a forward march over the non-negative integers with independent identically distributed waiting times. We embed the values of the counting numbers N in a “pseudo-spatial” non-negative half-line x ≥ 0 and observe that for physical time likewise we have t ≥ 0. Thus we apply the Laplace transform with respect to both variables x and t. Ap...
متن کاملTransient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 37 شماره
صفحات -
تاریخ انتشار 2001